A Novel Sectionalizing Method for Power System Parallel Restoration Based on Minimum Spanning Tree
نویسندگان
چکیده
منابع مشابه
A Novel Sectionalizing Method for Power System Parallel Restoration Based on Minimum Spanning Tree
Parallel restoration is a way to accelerate the black-start procedure of power systems following a blackout. An efficient sectionalizing scheme can reduce the restoration time of a system, taking into account the black-start ability, generation-load balance of subsystems, restoration time of branches, start-up time of generating units, and effects of dispatchable loads and faulted devices. Solv...
متن کاملParallel Minimum Spanning Tree Algorithm
The Minimal Spanning Tree (MST) problem is a classical graph problem which has many applications in various areas. In this paper we discuss a concurrent MST algorithm derived from Prim’s algorithm presented by Setia et al. in 2009, targeting symmetric multiprocessing (SMP) with a shared address space. The pseudocode of the algorithm is presented, combined with three interesting heuristics in or...
متن کاملA Stock Market Filtering Model Based on Minimum Spanning Tree in Financial Networks
There have been several efforts in the literature to extract as much information as possible from the financial networks. Most of the research has been concerned about the hierarchical structures, clustering, topology and also the behavior of the market network; but not a notable work on the network filtration exists. This paper proposes a stock market filtering model using the correlation - ba...
متن کاملA Method for Constructing Phylogenetic Tree Based on the Minimum Spanning Tree of the Complete Graph
The evolutionary history of various species can be represented by constructing the phylogenetic tree. In this paper, we proposed a novel method for constructing phylogenetic tree based on the minimal spanning tree of the complete graph, which is taken from the similarity matrix computed by 3D graphical representation of DNA sequences. This method didn’t require sequence alignment and the comput...
متن کاملCommunication - Optimal Parallel Minimum Spanning Tree AlgorithmsExtended
Lower and upper bounds for nding a minimum spanning tree (MST) in a weighted undirected graph on the BSP model are presented. We provide the rst non-trivial lower bounds on the communication volume required to solve the MST problem. Let p denote the number of processors, n the number of nodes of the input graph, and m the number of edges of the input graph. We show that in the worst case a tota...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Energies
سال: 2017
ISSN: 1996-1073
DOI: 10.3390/en10070948